Marching Surfaces: Isosurface Approximation using G1 Multi-Sided Surfaces

نویسندگان

  • Gustavo Chavez
  • Alyn P. Rockwood
چکیده

Marching surfaces is a method for isosurface extraction and approximation based on a G multisided patch interpolation scheme. Given a 3D grid of scalar values, an underlying curve network is formed using second order information and cubic Hermite splines. Circular arc fitting defines the tangent vectors for the Hermite curves at specified isovalues. Once the boundary curve network is formed, a loop of curves is determined for each grid cell and then interpolated with multi-sided surface patches, which are G continuous at the joins. The data economy of the method and its continuity preserving properties provide an effective compression scheme, ideal for indirect volume rendering on mobile devices, or collaborating on the Internet, while enhancing visual fidelity. The use of multisided patches enables a more natural way to approximate the isosurfaces than using a fixed number of sides or polygons as is proposed in the literature. This assertion is supported with comparisons to the traditional Marching Cubes algorithm and other G methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Volume Data Visualization Using Fractal Interpolation Surfaces

Visualization of medical or experimental data is often achieved by extracting an intermediate geometric representation of the data. One such popular method for extracting an isosurface from volume data is the Marching Cubes (MC) algorithm, which creates a polygon mesh by sampling the data at the vertices of the cubes of a 3D grid. We present a method for isosurface approximation that uses the v...

متن کامل

A Generalized Marching Cubes Algorithm Based On Non-Binary Classifications

We present a new technique for generating surface meshes from a uniform set of discrete samples. Our method extends the well-known marching cubes algorithm used for computing polygonal isosurfaces. While in marching cubes each vertex of a cubic grid cell is binary classified as lying above or below an isosurface, in our approach an arbitrary number of vertex classes can be specified. Consequent...

متن کامل

Iso-surface extraction in 4D with applications related to scale space

We present a method for extracting iso-surfaces and their intersections in 4D. Our work is a signiicant extension of the 3D Marching Lines algorithm with new orientation and implementation considerations. As a practical tool, it can be applied to track eeciently space curves, deened by diierential invariants, across increasing scale. Extraction d'iso-surfaces en 4D avec des applications la thho...

متن کامل

A Semi-Automatic Surface Reconstruction Framework Based on T-Surfaces and Isosurface Extraction Methods

Abstract. In this paper we present a new approach which integrates the T-Surfaces model and isosurface generation methods in a general framework for surface reconstruction in 3D medical images. T-Surfaces is a deformable model based on a triangulation of the image domain, a discrete surface model and an image threshold. Two types of isosurface generation methods are considered: the continuation...

متن کامل

Robust segmentation of anatomical structures with deformable surfaces and marching cubes

Computer assisted medical applications require often the reconstruction of anatomical structures to compute parameters useful for diagnosis or interventional planning. From CT and MRI datasets it is possible to obtain surface models of the organs of interest with a variety of algorithms, like Marching Cubes, level sets or deformable parametric surfaces. Each technique has advantages but also dr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1502.02139  شماره 

صفحات  -

تاریخ انتشار 2015